Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys
نویسندگان
چکیده
منابع مشابه
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys
Let G be a group of prime order q with generator g. We study hardcore subsets H ⊂ G of the discrete logarithm (DL) logg in the model of generic algorithms. In this model we count group operations such as multiplication and division, while computations with non-group data are for free. It is known from Nechaev [Math. Notes 55 (1994) 165] and Shoup [Lecture Notes in Comp. Sci., Vol. 1233, Springe...
متن کاملGeneric algorithms for the discrete logarithm problem
This can be a significantly harder problem. For example, say we are using a randomized (Las Vegas) algorithm. If β lies in 〈α〉 then we are guaranteed to eventually find logα β, but if not, we will never find it and it may be impossible to tell whether we are just very unlucky or β 6∈ 〈α〉. On the other hand, with a deterministic algorithm such as the baby-steps giant-steps method, we can unequiv...
متن کاملProtecting Secret Keys with Blind Computation Service Based on Discrete Logarithm
Normally computer users use a passphrase or a password to encrypt secret values in computer systems. In this case, to prevent the brute–force attack, the password should be long enough and difficult to guess. But, such kind of passwords are also difficult for the human beings to remember. In this paper, we propose a method for protecting secret keys. A secret key means secret value like the pas...
متن کاملA generic lower bound for the discrete logarithm problem
We now give a lower bound for solving the discrete logarithm problem with a generic group algorithm. We will show that if p is the largest prime divisor of N , then any generic group algorithm for the discrete logarithm problem must use Ω( √ p) group operations. In the case that the group order N = p is prime this bound is tight, since we have already seen that the problem can be solved with O(...
متن کاملGeneric Hardness of the Multiple Discrete Logarithm Problem
We study generic hardness of the multiple discrete logarithm problem, where the solver has to solve n instances of the discrete logarithm problem simultaneously. There are known generic algorithms which perform O( √ np) group operations, where p is the group order, but no generic lower bound was known other than the trivial bound. In this paper we prove the tight generic lower bound, showing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2001
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(00)00173-3